Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs,

Improved Algorithms for Recognizing p-Helly and Hereditary p-Helly Hypergraphs

A hypergraphH is set of vertices V together with a collection of non empty subsets of it, called the hyperedges of H. A partial hypergraph of H is a hypergraph whose hyperedges are all hyperedges of H, whereas for V ′ ⊆ V the subhypergraph (induced by V ) is a hypergraph with vertices V ′ and having as hyperedges the subsets obtained as non empty intersections of V ′ and each of the hyperedges ...

Coloring Bipartite Hypergraphs

Neighborhood hypergraphs of bipartite graphs

Matrix symmetrization and several related problems have an extensive literature, with a recurring ambiguity regarding their complexity status and their relation to graph isomorphism. We present a short survey of these problems to clarify their status. In particular we recall results from the literature showing that matrix symmetrization is in fact NP-hard, while graph isomorphism is still an op...

Recognizing Chordal-Bipartite Probe Graphs

A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such thatG can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph is called chordal-bipartite if it contains no chordless cycle of length strictly greater than 5. Such probe/non-probe completion problems have ...

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...